منابع مشابه
Our joint work with Miklós Csörgő
Topics in our joint work of twenty years are discussed. To name a few: asymptotic independence, strong approximation of additive functionals, iterated processes, path properties of the Cauchy principal value, Vervaat process.
متن کاملA linear programming approach to the Manickam-Miklós-Singhi conjecture
Iowa State University does not discriminate on the basis of race, color, age, religion, national origin, sexual orientation, gender identity, sex, marital status, disability, or status as a U.S. veteran. Inquiries can be directed to the Director of Equal Opportunity and Diversity, 3210 Beardshear Hall, (515) 294-7612. IOWA STATE UNIVERSITY A linear programming approach to the ManickamMiklos-Sin...
متن کاملNovember 2005 Volatility and Development Miklós Koren and Silvana Tenreyro
Why is GDP growth so much more volatile in poor countries than in rich ones? We identify four possible reasons: (i) poor countries specialize in more volatile sectors; (ii) poor countries specialize in fewer sectors; (iii) poor countries experience more frequent and more severe aggregate shocks (e.g. from macroeconomic policy); and (iv) poor countries' macroeconomic fluctuations are more highly...
متن کاملMiklós Müller: The deep history of eukaryotic metabolism
B ack in the deep, dark reaches of time, there existed a cell that became the ancestor of all eukary-otes, from unicellular microorganisms to dinosaurs to humans. What was that fi rst eukaryote like? What were its metabolic capabilities, and how were they organized? In the early 1970s, as a research associate at The Rockefeller University in New York, Miklós Müller started investigating these q...
متن کاملA linear bound on the Manickam-Miklós-Singhi conjecture
Suppose that we have a set of numbers x1, . . . , xn which have nonnegative sum. How many subsets of k numbers from {x1, . . . , xn} must have nonnegative sum? Manickam, Miklós, and Singhi conjectured that for n ≥ 4k the answer is ( n−1 k−1 ) . This conjecture is known to hold when n is large compared to k. The best known bounds are due to Alon, Huang, and Sudakov who proved the conjecture when...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Magyar Nyelv
سال: 2015
ISSN: 0025-0228,1588-1210
DOI: 10.18349/magyarnyelv.2015.1.114